Generating Even More Chaotic Instances in Hardware
نویسندگان
چکیده
It is well known that multiplication inside a computer does not follow the associative property because of roundoff effects. possible to use this fact generate other different chaotic instances maps or oscillators when three terms appears. Chaos very sensitive small changes in initial conditions and amplifies these rounding We condition build instances, which give results, Lü oscillator 2D map, we show one application create new pseudo random number generator using map. Both systems are simulated software hardware within an FPGA where another 144 map 81 can be created. To best our knowledge, it first paper analyze construction entities by
منابع مشابه
Finite groups have even more centralizers
For a finite group $G$, let $Cent(G)$ denote the set of centralizers of single elements of $G$. In this note we prove that if $|G|leq frac{3}{2}|Cent(G)|$ and $G$ is 2-nilpotent, then $Gcong S_3, D_{10}$ or $S_3times S_3$. This result gives a partial and positive answer to a conjecture raised by A. R. Ashrafi [On finite groups with a given number of centralizers, Algebra Collo...
متن کاملGenerating Satisfiable Problem Instances
A major difficulty in evaluating incomplete local search style algorithms for constraint satisfaction problems is the need for a source of hard problem instances that are guaranteed to be satisfiable. A standard approach to evaluate incomplete search methods has been to use a general problem generator and a complete search method to filter out the unsatisfiable instances. Unfortunately, this ap...
متن کاملGenerating Hard Satisfiable Scheduling Instances
We present a random generator of partially complete round robin timetables that produces exclusively satisfiable instances, and provide experimental evidence that there is an easy-hard-easy pattern in the computational difficulty of completing partially complete timetables as the ratio of the number of removed entries to the total number of entries of the timetable is varied. Timetables in the ...
متن کاملGenerating Chaotic Stream Ciphers Using Chaotic Systems
A new scheme for generating good pseudo-random numbers, based on the composition of chaotic maps, is studied. In this method, hereafter called the chaotic stream cipher, one first uses a known chaotic dynamical system to generate a sequence of pseudo-random bytes, then applies certain permutations to them, using the discretized version of another two-dimensional chaotic map. Standard statistica...
متن کاملGenerating Hard Instances of Lattice Problems
We give a random class of lattices in Z n so that, if there is a probabilistic polynomial time algorithm which nds a short vector in a random lattice with a probability of at least 1 2 then there is also a probabilistic polynomial time algorithm which solves the following three lattice problems in every lattice in Z n with a probability exponentially close to one. (1) Find the length of a short...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronics
سال: 2023
ISSN: ['2079-9292']
DOI: https://doi.org/10.3390/electronics12020332